منابع مشابه
Truncated Leximin solutions
This paper shows that three classic properties for bargaining solutions in an environment with a variable number of agents – Anonymity, Individual Monotonicity and Consistency – characterize a one-parameter class of Truncated Leximin solutions. Given a positive and possibly infinite α, a Truncated Leximin solution gives each agent the minimum of α and their Leximin solution payoff. JEL-Classifi...
متن کاملIntercomparison of Truncated Series Solutions
The relationship between truncated Fourier series solutions of several different long-wave evolution equations is explored. The models are all designed to represent the same physics in the asymptote of small nonlinearity and frequency dispersion, and yet give different numerical solutions for given values of dimensionless parameters. It is found that the problem of obtaining a steady solution i...
متن کاملA consensus leximin rule
In this paper we propose to widen both the domain and range of Arrovian social choice to allow for a more general and transparent model. The domain will be enlarged towards pro...les of extended orderings, while we allow the range to contain quasi-orderings, and thus possibly incomplete social relations. By adapting some standard axioms towards our framework, we can derive a generalization of t...
متن کاملThe Asymmetric Leximin Solution
In this article we define and characterize a class of asymmetric leximin solutions, that contains both the symmetric leximin solution of Imai [5] and the two-person asymmetric Kalai-Smorodinsky solution of Dubra [3] as special cases. Solutions in this class combine three attractive features: they are defined on the entire domain of convex n-person bargaining problems, they generally yield Paret...
متن کاملNew Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks
We study the problem of computing a leximinoptimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The first one is entirely original, and the other ones are partially based on exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2016
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2016.07.003